Why Is Multiclass Classification Hard?
نویسندگان
چکیده
In classification problems, as the number of classes increases, correctly classifying a new instance into one them is assumed to be more challenging than making same decision in presence fewer classes. The essence problem that using learning algorithm on each boundary individually better several simultaneously. However, why and when it happens still not well-understood today. This work’s main contribution introduce concept heterogeneity boundaries an explanation this phenomenon. Based definition boundaries, we analyze explain differences performance state art approaches solve multi-class classification. We demonstrate performances all approaches, except one-vs-one, decrease. show by encoding knowledge decomposition problem, can obtain results decompositions. benefits increase or decrease time takes train evaluate models. first provide intuitions illustrate effects synthetic datasets simplistic classifier. Then, how real dataset exhibits these principles, also under realistic algorithms. setting, devise method quantify different use decompose problem. significant improvements over state-of-the-art decompositions do take account.
منابع مشابه
Why Supertagging Is Hard
Tree adjoining grammar parsers can use a supertagger as a preprocessor to help disambiguate the category1 of words and thus speed up the parsing phase dramatically. However, since the errors in supertagging propagate to this phase, it is vital to keep the error rate of the supertagger phase reasonably low. With very large tagsets coming from extracted grammars, this error rate can be of almost ...
متن کاملWhy Matrix Theory is Hard
Recently Sen and Seiberg gave a prescription for constructing the matrix theory in any superstring background. We use their prescription to test the finite N matrix theory conjecture on an ALE space. Based on our earlier work with Shenker, we find a sharper discrepancy between matrix theory computation and supergravity prediction. We discuss subtleties in the light-front quantization which may ...
متن کاملWhy Security Testing Is Hard
PUBLISHED BY THE IEEE COMPUTER SOCIETY 1540-7993/03/$17.00 © 2003 IEEE IEEE SECURITY & PRIVACY 83 application operates as specified) much easier. However, several types of bugs routinely escape testing. Many of these flaws are not specification violations in the traditional sense, meaning that the application might behave correctly according to requirements, but it might perform some additional...
متن کاملWhy the Cosmological Constant Problem is Hard
We consider a recent proposal to solve the cosmological constant problem within the context of brane world scenarios with infinite volume extra dimensions. In such theories bulk can be supersymmetric even if brane supersymmetry is completely broken. The bulk cosmological constant can therefore naturally be zero. Since the volume of the extra dimensions is infinite, it might appear that at large...
متن کاملArchitectura Mismatch : Why Reuse Is So Hard
my isn't there more progress toward building systems f+om existing parts? One ansueT is that the assumptions of the parts about their intended environment are implicit and either don't match the actual environment oy conflict with those of other parts. The authors explore these problems in the context of their own experience with a compositional approach. F uture breakthroughs in software produ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3192514